Indecomposable channels with side information at the transmitter
نویسندگان
چکیده
منابع مشابه
Coding for quantum channels with side information at the transmitter
We consider the problem of coding for quantum channels with side information that is available ahead of time at the transmitter but not at the receiver. We find a single-letter expression for the entanglement-assisted quantum capacity of such channels which closely parallels Gel’fand and Pinsker’s solution to the classical version of the same problem. This theorem can also be used to find a low...
متن کاملOn MIMO Fading Channels with Side Information at the Transmitter
Transmission of information over a MIMO discrete-time flat fading channel with an average power constraint is considered. The scenario in which the transmitter alone has knowledge of the fading levels, as side information, is assumed. This knowledge may be provided in either a causal or a non-causal manner. Upper and lower bounds are derived for each of the two cases. The tools developed are ap...
متن کاملCommunication over Channels with Causal Side Information at the Transmitter
This work deals with communication over the AWGN channel with additive discrete interference, where the sequence of interference symbols is known causally at the transmitter. We use Shannon’s treatment for channels with side information at the transmitter as a framework to derive “optimal precoding” and “channel code design criterion” for the channel with known interference at the transmitter. ...
متن کاملNoise prediction for channels with side information at the transmitter
The computation of channel capacity with side information at the transmitter side (but not at the receiver side) requires, in general, extension of the input alphabet to a space of “strategies,” and is often hard. We consider the special case of a discrete memoryless modulo-additive noise channel = + , where the encoder observes causally the random state that governs the distribution of the noi...
متن کاملwith Side Information at the Transmitter
The basic problem that we will be looking at can be described as follows and is illustrated in Figure 1. The overall objective (as usual) is to reliably communicate a message m ∈ {1, . . . , 2nR} from the encoder to the decoder using the channel n times. The largest rate R for which this is possible is called the capacity of the channel. The channel that we can use is described by a conditional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1965
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(65)90267-6